QUICKEST PATHS IN SIMULATIONS OF PEDESTRIANS
نویسندگان
چکیده
منابع مشابه
Quickest Paths in Simulations of Pedestrians
This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions an...
متن کاملQuickest paths: parallelization and dynamization
Let N = (V, E, c, /) be a network, where G = (V, E), (VI = n and (El = m, is a directed graph, c(e) > 0 is the capacity and I(e) 2 0 is the lead time for each edge e E E. The transmission time to send u units of data from a given source s to a destination t using path p is T(a,p) = I(p) + &, where 1(p) is the sum of the lead times of the edges in p, and c(p) is the minimum capacity of the edges...
متن کاملQuickest Paths: Faster Algorithms and Dynamization
Given a network N = (V,E, c, l), where G = (V,E), |V | = n and |E| = m, is a directed graph, c(e) > 0 is the capacity and l(e) ≥ 0 is the lead time (or delay) for each edge e ∈ E, the quickest path problem is to find a path for a given source–destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast ...
متن کاملAn algorithm for ranking quickest simple paths
In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is O(Kr(m+n log n)), which is also the best-known complexity to solve this problem. The worst-case memory complexity is O(Kn), which improves the existing algorithms. Finally, com...
متن کاملAlgorithms for the quickest path problem and the enumeration of quickest paths
Let N = (V, R, e, I) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function 1. Let u be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Complex Systems
سال: 2011
ISSN: 0219-5259,1793-6802
DOI: 10.1142/s0219525911003281